A Simple Model for Complex Networks with Arbitrary Degree Distribution and Clustering
نویسندگان
چکیده
We present a stochastic model for networks with arbitrary degree distributions and average clustering coefficient. Many descriptions of networks are based solely on their computed degree distribution and clustering coefficient. We propose a statistical model based on these characterizations. This model generalizes models based solely on the degree distribution and is within the curved exponential family class. We present alternative parameterizations of the model. Each parameterization of the model is interpretable and tunable. We present a simple Markov Chain Monte Carlo (MCMC) algorithm to generate networks with the specified characteristics. We provide an algorithm based on MCMC to infer the network properties from network data and develop statistical inference for the model. The model is generalizable to include mixing based on attributes and other complex social structure. An application is made to modeling a protein to protein interaction network.
منابع مشابه
A simple model for complex networks with arbitrary degree distribution and clustering keywords: Random graph models; Markov Chain Monte Carlo; Statistical Exponential Families
We present a stochastic model for networks with arbitrary degree distributions and average clustering coefficient. Many descriptions of networks are based solely on their computed degree distribution and clustering coefficient. We propose a statistical model based on these characterizations. This model generalizes models based solely on the degree distribution. We present alternative parameteri...
متن کاملAxelrod’s Metanorm Games on Complex Networks
In this paper we adapt Axelrod’s metanorms model to run on arbitrary interaction structures. We propose a hybrid analytical methodology combining computer simulations with a novel mathematical approach that abstracts some details of evolutionary dynamics while retaining explicit and exact representation of underlying network topology. We construct simple network statistics based on the clusteri...
متن کاملOn a geometrization of the Chung-Lu model for complex networks
We consider a model for complex networks that was introduced by Krioukov et al. [14], where the intrinsic hierarchies of a network are mapped into the hyperbolic plane. Krioukov et al. show that this model exhibits clustering and the distribution of its degrees has a power law tail. We show that asymptotically this model locally behaves like the well-known Chung-Lu model in which two nodes are ...
متن کاملDynamics of infectious disease in clustered networks with arbitrary degree distributions
We investigate the effects of heterogeneous and clustered contact patterns on the timescale and final size of infectious disease epidemics. The abundance of transitive relationships (the number of 3 cliques) in a network and the variance of the degree distribution are shown to have large effects on the number ultimately infected and how quickly the epidemic propagates. The network model is base...
متن کاملA Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications
A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...
متن کامل